Combinatorial Optimization of Multi-agent Differential Evolution Algorithm
نویسندگان
چکیده
منابع مشابه
Combinatorial Optimization of Multi-agent Differential Evolution Algorithm
Combinatorial optimization is often with the local extreme point in large numbers. It is usually discontinuous, multidimensional, non-differentiable, constraint conditions, highly nonlinear NP problem. In this paper, according to the characteristics of combinatorial optimization problem, we put forward the combination optimization of multi-agent differential evolution algorithm (COMADE) through...
متن کاملWell Placement Optimization Using Differential Evolution Algorithm
Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...
متن کاملMULTI-OBJECTIVE OPTIMIZATION OF ARCH DAMS USING DIFFERENTIAL EVOLUTION METHODS
For optimization of real-world arch dams, it is unavoidable to consider two or more conflicting objectives. This paper employs two multi-objective differential evolution algorithms (MoDE) in combination of a parallel working MATLAB-APDL code to obtain a set of Pareto solutions for optimal shape of arch dams. Full dam-reservoir interaction subjected to seismic loading is considered. A benchmark ...
متن کاملwell placement optimization using differential evolution algorithm
determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...
متن کاملMulti-Agent Combinatorial Optimization under Submodular Functions
Submodular functions are the discrete ananlogue of convexity and generalize many known and well studied settings. They capture several economic principles such as decreasing marginal cost and correlated utilities. Multi-agent allocation problems over submodular functions arise in a variety of natural scenarios and have been the subject of extensive study over the last decade. In this proposal I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2014
ISSN: 1874-110X
DOI: 10.2174/1874110x01408011022